An approximate solution method for optimal buffer allocation in serial n-stage automatic production lines.

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Buffer Allocation in Production Lines Using an Automata Search

In this paper, we use a learning automata search technique (LAST), which is based on game theory, to solve the optimal buffer allocation problem in production lines. We have incorporated the search algorithm within a simulator in order to optimize the performance of a production line. We have conducted experiments with this algorithm on some problems for which optimal solutions are available in...

متن کامل

A Dynamic Programming Algorithm for the Buffer Allocation Problem in Homogeneous Asymptotically Reliable Serial Production Lines

In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly develo...

متن کامل

A New Algorithm for Buffer Allocation in Production Lines

In the paper a new efficient algorithm for the allocation of storage capacity in serial production lines is derived. The proposed method aims to find out the distribution of storage capacity between machines that minimizes the total buffer space assigned to the line satisfying a target production requirement. The algorithm relies on an iterative scheme that, starting from the minimal capacity r...

متن کامل

HBBA: hybrid algorithm for buffer allocation in tandem production lines

In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion dep...

متن کامل

Stochastic Algorithms for Buffer allocation in Reliable Production Lines

The allocation of buffers between workstations is a major optimization problem faced by manufacturing systems designers. It entails the determination of optimal buffer allocation plans in production lines with the objective of maximizing their throughput. We present and compare two stochastic approaches for solving the buffer allocation problem in large reliable production lines. The allocation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C

سال: 1987

ISSN: 0387-5024,1884-8354

DOI: 10.1299/kikaic.53.807